1 research outputs found
Enumeration of -Fibonacci Paths using Infinite Weighted Automata
In this paper, we introduce a new family of generalized colored Motzkin
paths, where horizontal steps are colored by means of colors, where
is the th -Fibonacci number. We study the enumeration of this
family according to the length. For this, we use infinite weighted automata.Comment: arXiv admin note: substantial text overlap with arXiv:1310.244